No Provable Limits Tòscientiic Knowledge'
نویسندگان
چکیده
In an article concerning problems that are impossible to solve exactly, but which can be computed in an average sense, J. F. Traub and H. Wozniakowski raised a challenge: \We believe it is time to up the ante and try to prove there are unanswerable scientiic questions. In other words, we would like to establish a physical GG odel's theorem.""1]. Out of this idea grew a workshop and computer scientists, all with various visions ofìimitations', involving the natural sciences or otherwise. Some of the ruminations of this group, and their subsequent email exchanges, have been collected in a Santa Fe Institute Report 2]. The title of this report, \On Limits", omits reference tòscien-tiic knowledge', which was largely unaddressed at this workshop. Likewise, published commentaries in the media concerning this workshop did not take notice of this basic concept 3]. In this article one concept of`scientiic knowl-edge' will be outlined, and the issue of limits of this scientiic knowledge will be addressed. Clearly, any tentative deenition of`scientiic knowledge' places a limitation on the range of knowledge that will be considered to bèscientiic'. To be 1
منابع مشابه
On the Power and Limits of Distance-Based Learning
We initiate the study of low-distortion finite metric embeddings in multi-class (and multi-label) classification where (i) both the space of input instances and the space of output classes have combinatorial metric structure, and (ii) the concepts we wish to learn are low-distortion embeddings. We develop new geometric techniques and prove strong learning lower bounds. These provable limits hol...
متن کاملProvable Security, Third International Conference, ProvSec 2009, Guangzhou, China, November 11-13, 2009. Proceedings
Reading a book is also kind of better solution when you have no enough money or time to get your own adventure. This is one of the reasons we show the provable security third international conference provsec 2009 guangzhou china november 11 13 2009 proceedings lecture notes in computer science as your friend in spending the time. For more representative collections, this book not only offers it...
متن کاملEverything Provable is Provable in Zero-Knowledge
Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, MiCali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show t h t ever...
متن کاملDescriptions and Unknowability
In a recent paper Horsten embarked on a journey along the limits of the domain of the unknowable. Rather than knowability simpliciter, he considered a priori knowability, and by the latter he meant absolute provability, i.e. provability that is not relativized to a formal system. He presented an argument for the conclusion that it is not absolutely provable that there is a natural number of whi...
متن کاملThe Impact of Decryption Failures on the Security of NTRU Encryption
NTRUEncrypt is unusual among public-key cryptosystems in that, with standard parameters, validly generated ciphertexts can fail to decrypt. This affects the provable security properties of a cryptosystem, as it limits the ability to build a simulator in the random oracle model without knowledge of the private key. We demonstrate attacks which use decryption failures to recover the private key. ...
متن کامل